منابع مشابه
Transposition-Invariant Self-Similarity Matrices
Self-similarity matrices have become an important tool for visualizing the repetitive structure of a music recording. Transforming an audio data stream into a feature sequence, one obtains a self-similarity matrix by pairwise comparing all features of the sequence with respect to a local cost measure. The basic idea is that similar audio segments are revealed as paths of low cost along diagonal...
متن کاملSimilarity of general population matrices and pseudo-Leslie matrices
A similarity transformation is obtained between general population matrices models of the Usher or Lefkovitch types and a simpler model, the pseudoLeslie model. The pseudo Leslie model is a matrix that can be decomposed in a row matrix, which is not necessarily non-negative and a subdiagonal positive matrix. This technique has computational advantages, since the solutions of the iterative probl...
متن کاملSimilarity of perturbations of Hessenberg matrices
To every infinite lower Hessenberg matrix D is associated a linear operator on l2. In this paper we prove the similarity of the operator D − ∆, where ∆ belongs to a certain class of compact operators, to the operator D−∆′, where ∆′ is of rank one. We first consider the case when ∆ is lower triangular and has finite rank; then we extend this to ∆ of infinite rank assuming that D is bounded. In S...
متن کاملSimilarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB similarity matrix S whose real entry sij expresses how similar vertex i (in GA) is to vertex j (in GB) : we say that sij is their similarity score. In the special case where GA = GB = G, the score sij is the similarity...
متن کاملLearning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to these methods is a similarity measure between every pair of data points. If the clusters are well-separated, the eigenvectors of the similarity matrix can be used to identify the clusters, essentially by identifying gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1986
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90182-5